Permutation trinomials over Fq3

We consider four classes of polynomials over the fields ${\mathbb{F}}_{q^3}$, $q=p^h$, $p>3$, $f_1(x)=x^{q^2+q-1}+A{x}^{q^2-q+1}+Bx$, $f_2(x)=x^{q^2+q-1}+A{x}^{q^3-q^2+q}+Bx$, $f_3(x)=x^{q^2+q-1}+A{x}^{q^2}-Bx$, $f_4(x)=x^{q^2+q-1}+A{x}^q-Bx$, where $A,B\in {\mathbb{F}}_q$. We find sufficient conditions on the pairs $(A,B)$ for which these polynomials permute ${\mathbb{F}}_{q^3}$ and we give lower bounds on the number of such pairs.     

Multifold factorizations of cyclic groups into subsets

Let $(G,+)$ be an abelian group. A finite multiset A over G is said to give a λ-fold factorization of G if there exists a multiset B over G such that each element of G occurs λ times in the multiset $A+B:=\{a+b:a\in A,b\in B\}$. In this article, restricting G to a cyclic group, we will provide sufficient conditions on a given multiset A under which the exact value or an upper bound of the minimum multiplicity λ of a factorization of G can be given by introducing a concept of ‘lcm-closure’. Furthermore, a couple of properties on a given factor A will be shown when A has a prime or prime power order (cardinality). A relation to multifold factorizations of the set of integers will be also glanced at a general perspective.     

Quadratic decomposition of symmetric semi-classical polynomial sequences of even class: an example from the case s = 2

In the present work, we deal with the quadratic decomposition of symmetric semi-classical polynomial sequences of even class. An example from class 2 is settled. We give an integral representation of the considered symmetric form.     

Analytic approximation of the blow‐up time for nonlinear differential equations by the ADM–Padé technique

We present a new approach to calculate analytic approximations of blow‐up solutions and their critical blow‐up times. Our approach applies the Adomian decomposition–Padé method to quickly and easily compute the critical blow‐up times, which comprises the Adomian decomposition method combined with the Padé approximants technique. We validate our new approach with a variety of numerical examples, including nonlinear ODEs, systems of nonlinear ODEs, and nonlinear PDEs. Furthermore, our new method is shown to be more convenient than prior art that relies on compound discretized algorithms. Copyright © 2013 John Wiley & Sons, Ltd.     

Error evaluation for Zernike polynomials fitting based phase compensation of digital holographic microscopy

Combining the experimental research with the simulation calculation, the error evaluation for Zernike polynomials fitting (ZPF) based phase compensation of digital holographic microscopy (DHM) is performed. The obtained results show that the reconstructed phase with high precision can be obtained by ZPF phase compensation algorithm. Moreover, the phase error for ZPF based phase compensation algorithm increases with both the variation of object height and object transverse area, the larger variation of object height, the larger of phase error, and the larger of object transverse area, the faster increase of RMS phase error. To decrease the error of ZPF phase compensation algorithm, it is required to ensure one of the variations of object height and object transverse area to be a small value. Importantly, the proposed method supplies a useful tool for the error evaluation of phase compensation algorithm.     

Hexanes/acetonitrile: a binary solvent system for the efficient monosilylation of symmetric primary and secondary diols

Symmetric diols are useful compounds in the synthesis of natural products, their value often dependent on their successful monoprotection. A general and simple method for the monosilylation of symmetrical primary and secondary diols is reported. The method exploits the solubility differential of diols and their monosilylated counterparts in a binary hexanes/acetonitrile solvent system.     

串联双路图的亏格分布

计算双路图的亏格分布是拓扑图论关注的一个问题,利用传递矩阵与向量积矩阵,给出了两类由双路图串联构建而成的两类闭链图的亏格分布.